Crystal bases , finite complete rewriting systems , and

This paper constructs presentations via finite complete rewriting systems for Plactic monoids of types An, Bn, Cn, Dn, and G2, using a unified proof strategy that depends on Kashiwara’s crystal bases and analogies of Young tableaux, and on Lecouvey’s presentations for these monoids. As corollaries, we deduce that Plactic monoids of these types have finite derivation type and satisfy the homological finiteness properties left and right FP∞. These rewriting systems are then applied to show that Plactic monoids of these types are biautomatic.